CIRCULAR CONSECUTIVE CHOOSABILITY OF GRAPHS
نویسندگان
چکیده
منابع مشابه
Circular consecutive choosability of graphs
Abstract This paper considers list circular colouring of graphs in which the colour list assigned to each vertex is an interval of a circle. The circular consecutive choosability chcc(G) of G is defined to be the least t such that for any circle S(r) of length r ≥ χc(G), if each vertex x of G is assigned an interval L(x) of S(r) of length t, then there is a circular r-colouring f of G such that...
متن کاملCircular consecutive choosability of k-choosable graphs
Let S(r) denote a circle of circumference r. The circular consecutive choosability chcc(G) of a graph G is the least real number t such that for any r > χc(G), if each vertex v is assigned a closed interval L(v) of length t on S(r), then there is a circular r-colouring f of G such that f(v) ∈ L(v). We investigate, for a graph, the relations between its circular consecutive choosability and choo...
متن کاملBounds on circular consecutive choosability
The circular consecutive choosability chcc(G) of a graph G has been recently introduced in [2]. In this paper we prove upper bounds on chcc for series-parallel graphs, planar graphs and k-choosable graphs. Our bounds are tight for classes of series-parallel graphs and k-choosable graphs for k ≥ 3. Then we study the circular consecutive choosability of generalized theta graphs. Lower bounds for ...
متن کاملCircular choosability of graphs
This paper discusses the circular version of list coloring of graphs. We give two definitions of the circular list chromatic number (or circular choosability) of a graph and prove that they are equivalent. Then we prove that for any graph , . Examples are given to show that this bound is sharp in the sense that for any , there is a graph with . It is also proved that -degenerate graphs have . T...
متن کاملCircular choosability
We study circular choosability, a notion recently introduced by Mohar and by Zhu. First, we provide a negative answer to a question of Zhu about circular cliques. We next prove that cch(G) = O (ch(G) + ln |V (G)|) for every graph G. We investigate a generalisation of circular choosability, the circular f -choosability, where f is a function of the degrees. We also consider the circular choice n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2008
ISSN: 1027-5487
DOI: 10.11650/twjm/1500404989